Continuations and Functional Equations

ثبت نشده
چکیده

The first part of this writeup gives Riemann’s argument that the completion of zeta, Z(s) = π−s/2Γ(s/2)ζ(s), Re(s) > 1 has a meromorphic continuation to the full s-plane, analytic except for simple poles at s = 0 and s = 1, and the continuation satisfies the functional equation Z(s) = Z(1− s), s ∈ C. The continuation is no longer defined by the sum. Instead, it is defined by a wellbehaved integral-with-parameter. Essentially the same ideas apply to Dirichlet L-functions,

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Notions of Computation Determine Monads

We model notions of computation using algebraic operations and equations. We show that these generate several of the monads of primary interest that have been used to model computational effects, with the striking omission of the continuations monad. We focus on semantics for global and local state, showing that taking operations and equations as primitive yields a mathematical relationship tha...

متن کامل

Continuations and Functional Equations

The first part of this writeup gives Riemann’s argument that the completion of zeta, Z(s) = π−s/2Γ(s/2)ζ(s), Re(s) > 1 has a meromorphic continuation to the full s-plane, analytic except for simple poles at s = 0 and s = 1, and the continuation satisfies the functional equation Z(s) = Z(1− s), s ∈ C. The continuation is no longer defined by the sum. Instead, it is defined by a wellbehaved integ...

متن کامل

Continuations and Functional Equations

The first part of this writeup gives Riemann’s argument that the closely related function Z(s) = π−s/2Γ(s/2)ζ(s), Re(s) > 1 has a meromorphic continuation to the full s-plane, analytic except for simple poles at s = 0 and s = 1, and the continuation satisfies the functional equation Z(s) = Z(1− s), s ∈ C. The continuation is no longer defined by the sum. Essentially the same ideas apply to Diri...

متن کامل

The Theory and Practice of Programming Languages with Delimited Continuations

This dissertation presents a study of functional programming languages with first-class delimited continuations. We focus mainly on theoretical and practical aspects of Danvy and Filinski’s hierarchy of static delimited-control operators shiftn and resetn, and of Felleisen’s dynamic delimited-control operators control and prompt. Our study uses the traditional means of specifying semantics of f...

متن کامل

Continuations and Functional Equations

The first part of this writeup gives Riemann’s argument that the completion of zeta, Z(s) = π−s/2Γ(s/2)ζ(s), Re(s) > 1 has a meromorphic continuation to the full s-plane, analytic except for simple poles at s = 0 and s = 1, and the continuation satisfies the functional equation Z(s) = Z(1− s), s ∈ C. The continuation is no longer defined by the sum. Instead, it is defined by a wellbehaved integ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015